Dynamic optimization of multipass milling operations via geometric programming
نویسندگان
چکیده
منابع مشابه
Digital Circuit Optimization via Geometric Programming
This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex optimization problem and then very efficiently solved. We start with a basic gate scaling problem, with delay modeled as a simple resistor-capacitor (RC) time constant, and then add various layers ...
متن کاملDynamic Programming via Convex Optimization
It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...
متن کاملPlunge milling time optimization via mixed-integer nonlinear programming
Plunge milling is a recent and efficient production mean for machining deep workpieces, notably in aeronautics. This paper focuses on the minimization of the machining time by optimizing the values of the cutting parameters. Currently, neither Computer-Aided Manufacturing (CAM) software nor standard approaches take into account the tool path geometry and the control laws driving the tool displa...
متن کاملNumerical Shape Optimization via Dynamic Programming
In this paper we describe a novel framework for finding numerical solutions to a wide range of shape optimization problems. It is based on classical dynamic programming approach augmented with discretization of the space of trajectories and controls. This allows for straightforward algorithmic implementation. This method has been used to solve a well known problem called the ”dividing tube prob...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Tools and Manufacture
سال: 1999
ISSN: 0890-6955
DOI: 10.1016/s0890-6955(98)00027-3